Unimodal Permutations and Almost-Increasing Cycles
نویسندگان
چکیده
منابع مشابه
Unimodal Permutations and Almost-Increasing Cycles
In this paper, we establish a natural bijection between the almost-increasing cyclic permutations of length n and unimodal permutations of length n − 1. This map is used to give a new characterization, in terms of pattern avoidance, of almostincreasing cycles. Additionally, we use this bijection to enumerate several statistics on almost-increasing cycles. Such statistics include descents, inver...
متن کاملCounting involutory, unimodal, and alternating signed permutations
In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given. © 2006 Elsevier B.V. All rights reserved. MSC: primary: 05A15; secondary: 05A19; 05A05
متن کاملThe cyclic structure of unimodal permutations
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure — e.g. 23 of them contain fixed points — are given. We also obtain in effect a kind of combinatorial universality for continuous unimodal maps, by severely constraining the possible ways periodic orbits of any such map can nestle together. Bu...
متن کاملAlmost avoiding permutations
We investigate the notion of almost avoiding a permutation: π almost avoids β if one can remove a single entry from π to obtain a β-avoiding permutation.
متن کاملDescents of λ-unimodal cyclic permutations
We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6954